Effect of congestion costs on shortest paths through complex networksASHTON, Douglas J; JARRETT, Timothy C; JOHNSON, Neil F et al.Physical review letters. 2005, Vol 94, Num 5, pp 058701.1-058701.4, issn 0031-9007Article

Enhancing traffic capacity for scale-free networks by the one-way linksKE HU; CHAOFEI LIU; TAO HU et al.Journal of physics. A, Mathematical and theoretical (Print). 2010, Vol 43, Num 17, issn 1751-8113, 175101.1-175101.10Article

A dual-ascent procedure for large-scale uncapacitated network designBALAKRISHNAN, A; MAGNANTI, T. L; WONG, R. T et al.Operations research. 1989, Vol 37, Num 5, pp 716-740, issn 0030-364X, 25 p.Article

Uncapacitated lot-sizing problems with start-up costsWOLSEY, L. A.Operations research. 1989, Vol 37, Num 5, pp 741-747, issn 0030-364X, 7 p.Article

Performance of shortest path algorithms in network flow problemsDIVOKY, J. J; HUNG, M. S.Management science. 1990, Vol 36, Num 6, pp 661-673, issn 0025-1909, 13 p.Article

Vertex labeling and routing in expanded Apollonian networksZHONGZHI ZHANG; COMELLAS, Francesc; FERTIN, Guillaume et al.Journal of physics. A, Mathematical and theoretical (Print). 2008, Vol 41, Num 3, issn 1751-8113, 035004.1-035004.10Article

An O(n³ (log log n/log n )^5/4) time algorithm for all pairs shortest pathsYIJIE HAN.Lecture notes in computer science. 2006, pp 411-417, issn 0302-9743, isbn 3-540-38875-3, 1Vol, 7 p.Conference Paper

A minimum-hop routing algorithm based on distributed informationGARCIA-LUNA-ACEVES, J. J.Computer networks and ISDN systems. 1988, Vol 16, Num 5, pp 367-382, issn 0169-7552, 16 p.Article

An O(n³(loglogn/log n)^5/4) Time Algorithm for All Pairs Shortest PathYIJIE HAN.Algorithmica. 2008, Vol 51, Num 4, pp 428-434, issn 0178-4617, 7 p.Article

On geometric structure of global roundings for graphs and range spacesASANO, Tetsuo; KATOH, Naoki; TAMAKI, Hisao et al.Lecture notes in computer science. 2004, pp 455-467, issn 0302-9743, isbn 3-540-22339-8, 13 p.Conference Paper

Developing a Scheduler with Difference-Bound Matrices and the Floyd-Warshall Algorithm : ALGORITHMS FOR TODAY'S PRACTIOTIONERRIDI, Lorenzo; TORRINI, Jacopo; VICARIO, Enrico et al.IEEE software. 2012, Vol 29, Num 1, pp 76-83, issn 0740-7459, 8 p.Article

Using selective path-doubling for parallel shortest-path computationsCOHEN, E.Journal of algorithms (Print). 1997, Vol 22, Num 1, pp 30-56, issn 0196-6774Article

The SPCP on two relaxed special-type networksLI, M. Z; FUSHIMI, M.Zeitschrift für angewandte Mathematik und Mechanik. 1996, Vol 76, pp 595-596, issn 0044-2267, SUP2Conference Paper

A note on the expected path length of trees with known fringeDE PRISCO, R; PARLATI, G; PERSIANO, G et al.Information processing letters. 1996, Vol 59, Num 6, pp 309-315, issn 0020-0190Article

Finding real-valued single-source shortest paths in o(n³) expected timeKOLLIOPOULOS, S. G; STEIN, C.Journal of algorithms (Print). 1998, Vol 28, Num 1, pp 125-141, issn 0196-6774Article

Finding the detour-critical-edge of a shortest path between two nodesNARDELLI, E; PROIETTI, G; WIDMAYER, P et al.Information processing letters. 1998, Vol 67, Num 1, pp 51-54, issn 0020-0190Article

Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulationsGOODRICH, M. T; TAMASSIA, R.Journal of algorithms (Print). 1997, Vol 23, Num 1, pp 51-73, issn 0196-6774Article

An efficient algorithm for shortest paths in vertical and horizontal segmentsEPPSTEIN, D; HART, D. W.Lecture notes in computer science. 1997, pp 234-247, issn 0302-9743, isbn 3-540-63307-3Conference Paper

On geometric path query problemsCHEN, D. Z; DAESCU, O; KLENK, K. S et al.Lecture notes in computer science. 1997, pp 248-257, issn 0302-9743, isbn 3-540-63307-3Conference Paper

The shortest distance between two nearly antipodean points on the surface of a spheroidWILLIAMS, R; PHYTHIAN, J. E.Journal of Navigation. 1992, Vol 45, Num 1, pp 114-125, issn 0373-4633Article

Stochastic shortest paths with recourseANDREATTA, G; ROMEO, L.Networks (New York, NY). 1988, Vol 18, Num 3, pp 193-204, issn 0028-3045Article

Finding feasible pathways in metabolic networksPITKÄNEN, Esa; RANTANEN, Ari; ROUSU, Juho et al.Lecture notes in computer science. 2005, pp 123-133, issn 0302-9743, isbn 3-540-29673-5, 1Vol, 11 p.Conference Paper

Three algorithms for a minimum cost file transfer problemKANEKO, Yoshihiro.MWSCAS : Midwest symposium on circuits and systems. 2004, isbn 0-7803-8346-X, 3Vol, Vol II, 493-496Conference Paper

A heuristic improvement of the Bellman-Ford algorithmGOLDBERG, A. V; RADZIK, T.Applied mathematics letters. 1993, Vol 6, Num 3, pp 3-6, issn 0893-9659Article

Linear hypertree for multi-dimensional image representation = Hyperarbre linéaire pour la représentation d'image multi-dimensionnelleIBAROUDENE, D; ACHARYA, R.Information sciences. 1993, Vol 68, Num 1-2, pp 123-154, issn 0020-0255Article